for i in range(int(input())):
x = []
for i in range(int(input())):
ls = list(map(int,input().split()))
if ls[0] <= 10:
x.append(ls[1])
else:
x.append(0)
print(x.index(max(x))+1)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
int main() {
ll t; cin>>t;
while(t--){
ll tt; cin>>tt;
vector<ll>sorted;
map<ll , ll>mapp;
for(ll i=0;i<tt;i++){
ll n,k; cin>>n>>k;
if(n>10) continue;
sorted.pb(k);
mapp[k]=i;
}
ll mx=*max_element(sorted.begin(),sorted.end());
cout<<mapp[mx]+1<<endl;
}
return 0;
}1654C - Alice and the Cake | 369A - Valera and Plates |
1626A - Equidistant Letters | 977D - Divide by three multiply by two |
1654B - Prefix Removals | 1654A - Maximum Cake Tastiness |
1649A - Game | 139A - Petr and Book |
1612A - Distance | 520A - Pangram |
124A - The number of positions | 1041A - Heist |
901A - Hashing Trees | 1283A - Minutes Before the New Year |
1654D - Potion Brewing Class | 1107B - Digital root |
25A - IQ test | 785A - Anton and Polyhedrons |
1542B - Plus and Multiply | 306A - Candies |
1651C - Fault-tolerant Network | 870A - Search for Pretty Integers |
1174A - Ehab Fails to Be Thanos | 1169A - Circle Metro |
780C - Andryusha and Colored Balloons | 1153A - Serval and Bus |
1487C - Minimum Ties | 1136A - Nastya Is Reading a Book |
1353B - Two Arrays And Swaps | 1490E - Accidental Victory |